Generic expansions by a reduct
نویسندگان
چکیده
Consider the expansion [Formula: see text] of a theory by predicate for submodel reduct text]. We present setup in which this admits model companion show that some nice features transfer to In particular, we study conditions preserves text]-ness, simplicity or stability starting give concrete examples new not simple theories obtained process, among them perfect text]-free field positive characteristic generic additive subgroups, and an algebraically closed any multiplicative subgroup.
منابع مشابه
Generic Expansions of Ordered Structures
Let T be a complete first order theory in a language L satisfying uniform finiteness and let TP be the model companion of T in an expanded language LP with a new unary predicate P . We show that: TP satisfies uniform finiteness; if T is an expansion of the theory of dense linear order then every cut definable in a model M of TP is definable in M L; and, if T is an expansion of the theory dense ...
متن کاملGeneric Expansions of Countable Models
We compare two different notions of generic expansions of countable saturated structures. On one hand there is a kind of genericity related to modelcompanions and to amalgamation constructions à la Hrushovski-Fräıssé; on the other, there is a notion of generic expansions defined via topological properties and Baire category theory. The second type of genericity was first formulated by Truss for...
متن کاملA Heuristic Optimal Reduct Algorithm
Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining, In this paper, we propose a heuristic reduct finding algorithm, which is based on frequencies of attributes appeared in discernibility matrix. Our method does not guarantee to find optimal reduct, but experiment shows that in most situations it doe...
متن کاملOn Reduct Construction Algorithms
This paper critically analyzes reduct construction methods at two levels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic groups based on the underlying control structures. At a low level, by adopting different heuristics or fitness functions for attribute selection, one is able to derive most of the existing algorithms. The analy...
متن کاملOn Constrained Generic Expansions and Structural Ramsey Theory
It is reasonably well-known in model theory that expansions of countable countablycategorical structures are closely associated with certain compactly metrizable spaces and, further, that a generic orbit in such a space – in the sense of Baire category – corresponds to an expansion with a particularly well-behaved model theory (relative to the base structure). Results of this kind can be found ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Logic
سال: 2021
ISSN: ['0219-0613', '1793-6691']
DOI: https://doi.org/10.1142/s0219061321500161